Efficient Side-Channel Attacks on Scalar Blinding on Elliptic Curves with Special Structure
نویسندگان
چکیده
In this paper we introduce two new generic sidechannel attacks on scalar blinding of elliptic curves where the order of the base point is close to a power of 2. These attacks are in particu lar relevant for elliptic curves over special prime fields where the prime is ’almost’ a power of 2. As in the papers [9, 10] we assume that some side-channel attack has allowed the determina tion of the bits of the blinded scalars with some uncertainty, which is quantified by the error rate Eb. Our new attacks are tailored to the special structure of these elliptic curves. They are far more efficient than the attacks for general ellip tic curves [9, 10]. As a consequence such special elliptic curves need significantly longer blinding factors than general elliptic curves. Both attacks apply to ECC applications, which use a longterm key for the scalar multiplication.
منابع مشابه
Side-Channel Analysis on Blinded Regular Scalar Multiplications
We present a new side-channel attack path threatening stateof-the-art protected implementations of elliptic curves embedded scalar multiplications. Regular algorithms such as the double-and-add-always and the Montgomery ladder are commonly used to protect the scalar multiplication from simple side-channel analysis. Combining such algorithms with scalar and/or point blinding countermeasures lead...
متن کاملEfficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
We propose efficient algorithms and formulas that improve the performance of side-channel protected elliptic curve computations, with special focus on scalar multiplication exploiting the GallantLambert-Vanstone (CRYPTO 2001) and Galbraith-Lin-Scott (EUROCRYPT 2009) methods. Firstly, by adapting Feng et al.’s recoding to the GLV setting, we derive new regular algorithms for variable-base scalar...
متن کاملFast Elliptic Curve Multiplications Resistant against Side Channel Attacks
This paper proposes fast elliptic curve multiplication algorithms resistant against side channel attacks, based on the Montgomerytype scalar multiplication. The proposed scalar multiplications can be applied to all curves over prime fields, e.g., any standardized curves over finite fields with characteristic larger than 3. The method utilizes the addition formulas xECDBL and xECADD assembled by...
متن کاملParallel scalar multiplication on general elliptic curves over Fp hedged against Non-Differential Side-Channel Attacks
For speeding up elliptic curve scalar multiplication and making it secure against side-channel attacks such as timing or power analysis, various methods have been proposed using speci cally chosen elliptic curves. We show that both goals can be achieved simultaneously even for conventional elliptic curves over Fp . This result is shown via two facts. First, we recall the known fact that every e...
متن کاملEfficient and side-channel-aware implementations of elliptic curve cryptosystems over prime fields
Elliptic curve cryptosystems (ECCs) are utilised as an alternative to traditional public-key cryptosystems, and are more suitable for resource-limited environments because of smaller parameter size. In this study, the authors carry out a thorough investigation of side-channel attack aware ECC implementations over finite fields of prime characteristic including the recently introduced Edwards fo...
متن کامل